A simpler axiomatization of the Shelah-Spencer almost sure theories
نویسنده
چکیده
We give an explicit AE-axiomatization of the almost sure theories of sparse random graphs G(n, n−α) of Shelah-Spencer. In the process we give a method of constructing extensions of graphs whose ‘relative dimension’ is negative, but arbitrarily small. We describe the existentially closed and locally finite models of the theory and produce types of dimension zero. We offer a useful characterization of forking and generalize results about stability and the Dimensional Order Property (DOP) that were known for graphs to arbitrary relational languages.
منابع مشابه
Random unary predicates: Almost sure theories and countable models
Let Un,p be the random unary predicate and Tk the almost sure first-order theory of Un,p under the linear ordering, where k is a positive integer and n−1/k p(n) n−1/(k+1). For each k, we give an axiomatization for the theory Tk. We find a model Mk of Tk of order type roughly that of Z and show that no other models of Tk exist of smaller size.
متن کاملDOP and FCP in Generic Structures
We work throughout in a finite relational language L. This paper is built on [2] and [3]. We repeat some of the basic notions and results from these papers for the convenience of the reader but familiarity with the setup in the first few sections of [3] is needed to read this paper. Spencer and Shelah [6] constructed for each irrational α between 0 and 1 the theory T α as the almost sure theory...
متن کاملConstructing ω-stable Structures: Model Completeness
The projective plane of [2] is model complete in a language with additional constant symbols. The infinite rank bicolored field of [14] is not model complete. The finite rank bicolored fields of [4, 6] are model complete. More generally, the finite rank expansions of a strongly minimal set obtained by adding a ‘random’ unary predicate are almost strongly minimal and model complete provided the ...
متن کاملRandom Sparse Bit Strings at the Threshold of Adjacency
(where Un, c √ n is the random bit string of length n) is infinitely differentiable. Our methodology for showing this is in itself interesting. We begin with finite models, go to the infinite (via the almost sure theories) and then characterize fφ(c) as an infinite sum of products of polynomials and exponentials. We further show that if a sentence φ has limiting probability 1 for some c, then φ...
متن کاملThe Almost Sure Convergence for Weighted Sums of Linear Negatively Dependent Random Variables
In this paper, we generalize a theorem of Shao [12] by assuming that is a sequence of linear negatively dependent random variables. Also, we extend some theorems of Chao [6] and Thrum [14]. It is shown by an elementary method that for linear negatively dependent identically random variables with finite -th absolute moment the weighted sums converge to zero as where and is an array of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006